منابع مشابه
Circuit-switched gossiping in the 3-dimensional torus networks
in this paper we describe, in the case of short messages, an efficient gossiping algorithm for 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuitswitched routing. The algorithm is based on a recursive decomposition of a torus. The algorithm requires an optimal number of rounds and a quasi-optimal number of intermediate switch settings to gossip in an 7i ...
متن کاملCircuit-Switched Gossiping in 3-Dimensional Torus Networks
In this paper we describe an eecient gossiping algorithm for short messages into the 3?dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuit-switched routing. The algorithm is based on a recursive decomposition of a torus. It requires an optimal number of rounds and a quasi-optimal number of intermediate switch settings to gossip in a 7 i 7 i 7 i torus network.
متن کاملOptimization of Circuit Switched Networks
Anders Svensson and Lars Reneby Department of Communication Systems Lund Institute of Technology P. O. Box 118, 22100 Lund, Sweden Abstract This paper describes a very general method which will be used for optimization of circuit switched networks in the design phase. The method used is based on a formal mathematical description of the network. Based on this description the performance of a num...
متن کاملModelling Circuit - Switched Multi - Stage Interconnection Networks
Peter G Harrison and N aresh M Patel Department of Computing Imperial College London A major component of a parallel machine is its interconnection network (IN), which provides concurrent communication between the processing elements. It is common to use a multi-stage interconnection network (MIN) which is constructed using crossbar switches and introduces contention not only for destination ad...
متن کاملNonstationary analysis of circuit-switched communication networks
Circuit-switched communication networks have been analyzed extensively in the stationary case, i.e. where the arrival and/or service rates are time-independent. In this paper, we study a circuit-switched network where the external arrival rates to the network are time-dependent functions. The circuit-switched network is modelled as a nonstationary queueing network with population constraints, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1987
ISSN: 0091-1798
DOI: 10.1214/aop/1176992089